Average Delay and Queue Length Model for WRRPQ
نویسندگان
چکیده
We present a new iterative mathematical model for calculating the average bandwidth assigned to traffic flows using a Weighted Round Robin with Priority queuing (WRRPQ) scheduler with both strict and rate controlled priority in IP based NGN networks. The bandwidth assignment estimation is based on the average packet length, link speed and the arrival rate. We prove the model outcome with examples and simulation results using NS2 simulator. Key-Words: Bandwidth Constraint Model, IP, NGN, WRRPQ, PQ, WRR
منابع مشابه
VRED: An improvement over RED algorithm by using queue length growth velocity
Active Queue Management (AQM) plays an important role in the Internet congestion control. It tries to enhance congestion control, and to achieve tradeoff between bottleneck utilization and delay. Random Early Detection (RED) is the most popular active queue management algorithm that has been implemented in the in Internet routers and is trying to supply low delay and low packet loss. RED al...
متن کاملVRED: An improvement over RED algorithm by using queue length growth velocity
Active Queue Management (AQM) plays an important role in the Internet congestion control. It tries to enhance congestion control, and to achieve tradeoff between bottleneck utilization and delay. Random Early Detection (RED) is the most popular active queue management algorithm that has been implemented in the in Internet routers and is trying to supply low delay and low packet loss. RED al...
متن کاملQueues with Choice via Delay Differential Equations
Delay or queue length information has the potential to influence the decision of a customer to join a queue. Thus, it is imperative for managers of queueing systems to understand how the information that they provide will affect the performance of the system. To this end, we construct and analyze two two-dimensional deterministic fluid models that incorporate customer choice behavior based on d...
متن کاملFinite Capacity Queuing System with Vacations and Server Breakdowns
This paper deals with finite capacity single server queuing system with vacations. Vacation starts at rate nu if the system is empty. Also the server takes another vacation if upon his arrival to the system, finds the system empty. Customers arrive in the system in Poisson fashion at rate lamda0 during vacation, faster rate lamdaf during active service and slower rate lamdas during the breakdow...
متن کاملMaximum Entropy Analysis for G/G/1 Queuing System (TECHNICAL NOTE)
This paper provides steady state queue-size distribution for a G/G/1 queue by using principle of maximum entropy. For this purpose we have used average queue length and normalizing condition as constraints to derive queue-size distribution. Our results give good approximation as demonstrated by taking a numerical illustration. In particular case when square coefficient of variation of inter-arr...
متن کامل